首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10447篇
  免费   1975篇
  国内免费   973篇
化学   6937篇
晶体学   85篇
力学   672篇
综合类   88篇
数学   1213篇
物理学   4400篇
  2024年   8篇
  2023年   242篇
  2022年   254篇
  2021年   375篇
  2020年   427篇
  2019年   422篇
  2018年   355篇
  2017年   341篇
  2016年   525篇
  2015年   485篇
  2014年   557篇
  2013年   763篇
  2012年   929篇
  2011年   1032篇
  2010年   649篇
  2009年   676篇
  2008年   684篇
  2007年   583篇
  2006年   536篇
  2005年   445篇
  2004年   342篇
  2003年   281篇
  2002年   259篇
  2001年   208篇
  2000年   219篇
  1999年   209篇
  1998年   212篇
  1997年   191篇
  1996年   144篇
  1995年   194篇
  1994年   165篇
  1993年   125篇
  1992年   101篇
  1991年   86篇
  1990年   90篇
  1989年   63篇
  1988年   42篇
  1987年   33篇
  1986年   35篇
  1985年   21篇
  1984年   18篇
  1983年   20篇
  1982年   12篇
  1981年   6篇
  1980年   10篇
  1979年   2篇
  1978年   4篇
  1975年   3篇
  1974年   2篇
  1957年   3篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
为了降低噪声影响,恢复光谱的连续谱和谱线等主要特征,以便准确测量谱线的等值宽度,文章根据天体光谱自身具有局部自相似性,而随机白噪声不具有自相似性,首次将分形方法应用于天体光谱降噪.实验表明,分形降噪方法对于准确测量谱线的等值宽度、星系红移等参数是有效的,此外,还可以实现数据压缩.分形方法适用于海量光谱的降噪和数据存储.  相似文献   
992.
以发射光谱法为基础,检测了常压状态线-板式脉冲电晕放电过程OH自由基在反应器内的空间分布;研究了线电极直径,线线间距以及线板间距对生成OH自由基的影响;从而明确脉冲电晕放电反应器的性能。结果显示:OH自由基浓度沿线电极X轴方向逐渐降低,活化区域半径20mm左右,沿Y轴方向先升高后降低,活化区域半径大于30mm;线电极的直径小于2mm时,OH自由基的光谱强度基本不变,线电极直径继续增大,发射光谱强度随之迅速下降。线线间距逐渐增大,OH自由基的发射光谱强度随之增强。OH自由基的发射光谱强度随着线板间距的增大而降低。  相似文献   
993.
对sol-gel法制备的不同稀土元素(Ce,Nd,Sm)掺杂的纳米TiO2粒子进行研究。X射线衍射(XRD)和X射线光电子能谱(XPS)分析结果表明,稀土离子均以间隙的形式均匀分布在纳米TiO2晶格内。傅里叶变换红外光谱(FTIR)和太赫兹时域光谱(THz-TDS)显示,掺杂TiO2较纯TiO2具有更强的红外活性;在0.2~1.70 THz波段,TiO2的折射率随着频率的增加而减小,并呈现反常色散现象;Ce掺杂引起新的特征吸收,分别为1.35和1.58 THz,且造成太赫兹吸收谱的吸收边发生红移,Nd和Sm掺杂则造成吸收边蓝移。在0.2~1.7 THz范围内,Sm掺杂引起的介电损耗角正切值(taneδ)最小,其平均值为0.05。  相似文献   
994.
Clifford algebra is introduced as a theoretical foundation for network topology expression and algorithm construction. Network nodes are coded with basis vectors in a vector space , and the edges and k‐walk routes can be expressed by 2‐blades and k‐blades, respectively, in the Clifford algebra Cl(n,0). The topologies among nodes, edges, and routes of networks can be directly calculated, and the network routes can be extended and traversed with oriented join products. The network algorithm construction processes based on Clifford algebra are instantiated by the single source shortest path algorithm. The experimental results on different scale random networks suggest that Clifford algebra is suited for network expression and relation computation. The Clifford algebra‐based shortest path algorithm is vivid and clear in geometric meaning and has great advantage on temporal and spatial complexity. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
995.
We investigate an automobile supply chain where a manufacturer and a retailer serve heterogeneous consumers with electric vehicles (EVs) under a government’s price-discount incentive scheme that involves a price discount rate and a subsidy ceiling. We show that the subsidy ceiling is more effective in influencing the optimal wholesale pricing decision of the manufacturer with a higher unit production cost. However, the discount rate is more effective for the manufacturer with a lower unit production cost. Moreover, the expected sales are increasing in the discount rate but may be decreasing in the subsidy ceiling. Analytic results indicate that an effective incentive scheme should include both a discount rate and a subsidy ceiling. We also derive the necessary condition for the most effective discount rate and subsidy ceiling that maximize the expected sales of EVs, and obtain a unique discount rate and subsidy ceiling that most effectively improve the manufacturer’s incentive for EV production.  相似文献   
996.
本文研究一类具有捕食正效应的Holling Ⅱ功能性反应的食饵-捕食者系统:dx/dt=rx(1-x/k+εy/k)-αxy/1+ωx,dy/dt=kαxy/1+ωx-dy,讨论其平衡点的性态.  相似文献   
997.
In this paper,we analyze the blow-up behavior of sequences{uk}satisfying the following conditionsΔuk=|x|2αk V k eukinΩ,(0.1)whereΩR2,V k→V in C1,|Vk|≤A,0a≤Vk≤b,0≤αk→α∈(0,∞),andΩ|x|2αkeuk dx≤Λ1.(0.2)Furthermore,we assume that there exists someq∈(1,2)such that rq 2Br(p)|uk|qdx≤Λ2(0.3)for anyB r(p)Ω.As a result,we give a new proof of the concentration-compactness theorem for the mean feld equation.  相似文献   
998.
Erdös and Niven proved in 1946 that for any positive integers m and d, there are at most finitely many integers n   for which at least one of the elementary symmetric functions of 1/m,1/(m+d),…,1/(m+(n−1)d)1/m,1/(m+d),,1/(m+(n1)d) are integers. Recently, Wang and Hong refined this result by showing that if n?4n?4, then none of the elementary symmetric functions of 1/m,1/(m+d),…,1/(m+(n−1)d)1/m,1/(m+d),,1/(m+(n1)d) is an integer for any positive integers m and d. Let f   be a polynomial of degree at least 2 and of nonnegative integer coefficients. In this paper, we show that none of the elementary symmetric functions of 1/f(1),1/f(2),…,1/f(n)1/f(1),1/f(2),,1/f(n) is an integer except for f(x)=xmf(x)=xm with m?2m?2 being an integer and n=1n=1.  相似文献   
999.
A non-increasing sequence \({\pi = (d_1, d_2, \ldots, d_n)}\) of non-negative integers is said to be graphic if it is the degree sequence of a simple graph G on n vertices. Let A be an (additive) abelian group. An extremal problem for a graphic sequence to have an A-connected realization is considered as follows: determine the smallest even integer \({\sigma (A, n)}\) such that each graphic sequence \({\pi = (d_1, d_2, \ldots, d_n)}\) with d n ≥ 2 and \({\sigma (\pi) = d_1 + d_2 + \cdots +d_n \ge \sigma (A, n)}\) has an A-connected realization. In this paper, we determine \({\sigma (A, n)}\) for |A| ≥ 5 and n ≥ 3.  相似文献   
1000.
This paper aims at showing that the class of augmented Lagrangian functions for nonlinear semidefinite programming problems can be derived, as a particular case, from a nonlinear separation scheme in the image space associated with the given problem. By means of the image space analysis, a global saddle point condition for the augmented Lagrangian function is investigated. It is shown that the existence of a saddle point is equivalent to a regular nonlinear separation of two suitable subsets of the image space. Without requiring the strict complementarity, it is proved that, under second order sufficiency conditions, the augmented Lagrangian function admits a local saddle point. The existence of global saddle points is then obtained under additional assumptions that do not require the compactness of the feasible set. Motivated by the result on global saddle points, we propose two modified primal-dual methods based on the augmented Lagrangian using different strategies and prove their convergence to a global solution and the optimal value of the original problem without requiring the boundedness condition of the multiplier sequence.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号